Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [1] states during reachability analysis, in order to counter the effects of the well-known state space explosion problem in explicitstate model checking. Their answer was to store not all but only some strategical states. They pay in run-time if the answer too often is “Not To Store”. We propose a different strategy to adaptively trade time for space: “To Store ” as many states as memory limits permit. If free memory becomes scarce, we gradually swap states out to secondary storage. We are careful to minimize revisits, and I/O overhead, and also stay sound, i.e. on termination it is guaranteed that the full state space has been explored. It is also available fo...
Abstract. In this paper, we consider disk based exploration in priced timed au-tomata for resource-o...
State memoization is critical to the good performance of heuristic forward search planners, which re...
Recently, a method to bound the steady-state availability using the failure distance concept has bee...
Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [3] states during r...
Abstract. To limit the explosion problem encountered during reacha-bility analysis we suggest a vari...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
Formal methods have an unprecedented ability to en-dorse the correctness of a system. In spite of th...
Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of tha...
International audienceModel-checking enables the automated formal verification of software systems t...
pre-printThe enormous number of states reachable during explicit model checking is the main bottlene...
Abstract. The ComBack method is a memory reduction technique for explicit state space search algorit...
International audienceExhaustive verification often suffers from the state-explosion problem, where ...
Abstract. We describe a dynamic partitioning scheme usable by model checking techniques that divide ...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
When performing temporal planning as forward state-space search, effective state memoisation is chal...
Abstract. In this paper, we consider disk based exploration in priced timed au-tomata for resource-o...
State memoization is critical to the good performance of heuristic forward search planners, which re...
Recently, a method to bound the steady-state availability using the failure distance concept has bee...
Abstract. Behrmann et al. posed the question whether “To Store or Not To Store ” [3] states during r...
Abstract. To limit the explosion problem encountered during reacha-bility analysis we suggest a vari...
National audienceThe limited amount of memory is the major bottleneck in model checkingtools and alg...
Formal methods have an unprecedented ability to en-dorse the correctness of a system. In spite of th...
Formal methods have an unprecedented ability to endorse the correctness of a system. In spite of tha...
International audienceModel-checking enables the automated formal verification of software systems t...
pre-printThe enormous number of states reachable during explicit model checking is the main bottlene...
Abstract. The ComBack method is a memory reduction technique for explicit state space search algorit...
International audienceExhaustive verification often suffers from the state-explosion problem, where ...
Abstract. We describe a dynamic partitioning scheme usable by model checking techniques that divide ...
. In the context of model-checking, state space reduction techniques are often conservative in the s...
When performing temporal planning as forward state-space search, effective state memoisation is chal...
Abstract. In this paper, we consider disk based exploration in priced timed au-tomata for resource-o...
State memoization is critical to the good performance of heuristic forward search planners, which re...
Recently, a method to bound the steady-state availability using the failure distance concept has bee...